- dynamic combinatorial library
- динамическая комбинаторная библиотека
English-Russian Biotechnology Glossary. A. F. Valikhov, V. V. Kolotvin, O. A. Legonkova, I. A. Rogov, Thomas Creamer. 2007.
dynamic combinatorial library
Смотреть что такое "dynamic combinatorial library" в других словарях:
Dynamic combinatorial chemistry — is defined as combinatorial chemistry under thermodynamic control.[1] Contents 1 Introduction 2 Current Applications 2.1 Medicine and Pharmaceutical … Wikipedia
Combinatorial chemistry — involves the rapid synthesis or the computer simulation of a large number of different but structurally related molecules or materials. It is especially common in CADD (Computer aided drug design) and can be done online with web based software,… … Wikipedia
Translational frameshift — Translational frameshifting or ribosomal frameshifting refers to an alternate process of protein translation. Normally, a protein is translated from one end of the template to the other, generally from the 3 to the 5 end (or 5 to 3 ends of the… … Wikipedia
Chemical biology — is a scientific discipline spanning the fields of chemistry and biology that involves the application of chemical techniques and tools, often compounds produced through synthetic chemistry, to the study and manipulation of biological systems.… … Wikipedia
Action selection — is a way of characterizing the most basic problem of intelligent systems: what to do next. In artificial intelligence and computational cognitive science, the action selection problem is typically associated with intelligent agents and animats… … Wikipedia
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Sequence alignment — In bioinformatics, a sequence alignment is a way of arranging the sequences of DNA, RNA, or protein to identify regions of similarity that may be a consequence of functional, structural, or evolutionary relationships between the sequences.[1]… … Wikipedia
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
Computer Go — Part of a series of articles on Go (board game) Game specifics Go rules Go handicaps Go proverbs Go terms Go strategy and tactics Fuseki (whole board openings) Joseki (corner based openings) Life and death Tsumego … Wikipedia
Solid modeling — The geometry in solid modeling is fully described in 3‑D space; objects can be viewed from any angle. Modeled and ray traced in Cobalt Solid modeling (or modelling) is a consistent set of principles for mathematical and computer modeling of three … Wikipedia
